Relational Validity Dynamic Predicate Logic
نویسنده
چکیده
In this paper we prove that the principles in the language with relation composition and dynamic implication valid for all binary relations are the same ones as the principles valid when we restrict ourselves to DPL relations i e relations generated from conditions tests and resettings
منابع مشابه
Sequence semantics for dynamic predicate logic
In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments This semantics is compared with the usual relational semantics for dynamic predicate logic it is shown that the most important intuitions of the usual se mantics are preserved Then it is shown that the re ned semantics re ects out intuitions about information growth Some other issues in dyna...
متن کاملSequential Dynamic Logic
We introduce a substructural propositional calculus of Sequential Dynamic Logic (SDL) that subsumes a propositional part of dynamic predicate logic (DPL), and is shown to be expressively equivalent to propositional dynamic logic (PDL). Completeness of the calculus with respect to the intended relational semantics is established.
متن کاملRelational Validity & Dynamic Predicate
In this paper we prove that the principles in the language with relation composition and dynamic implication, valid for all binary relations, are the same ones as the principles valid when we restrict ourselves to DPL-relations, i.e., relations generated from conditions (tests) and resettings.
متن کاملKleene Algebra with Tests and Demonic Refinement Algebras
We formalise Kleene algebra with tests (KAT) and demonic refinement algebra (DRA) in Isabelle/HOL. KAT is relevant for program verification and correctness proofs in the partial correctness setting. While DRA targets similar applications in the context of total correctness. Our formalisation contains the two most important models of these algebras: binary relations in the case of KAT and predic...
متن کاملDomain and Antidomain Semigroups
We axiomatise and study operations for relational domain and antidomain on semigroups and monoids. We relate this approach with previous axiomatisations for semirings, partial transformation semigroups and dynamic predicate logic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995